منابع مشابه
A Tree Version of Konig's Theorem
König's theorem states that the covering number and the matching number of a bipartite graph are equal. We prove a generalisation, in which the point in one fixed side of the graph of each edge is replaced by a subtree of a given tree. The proof uses a recent extension of Hall's theorem to families of hypergraphs, by the first author and P. Haxell [3]. 1. Width and matching width of families of...
متن کاملA More General Version of the Costa Theorem
In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...
متن کاملA FUZZY VERSION OF HAHN-BANACH EXTENSION THEOREM
In this paper, a fuzzy version of the analytic form of Hahn-Banachextension theorem is given. As application, the Hahn-Banach theorem for$r$-fuzzy bounded linear functionals on $r$-fuzzy normedlinear spaces is obtained.
متن کاملa fuzzy version of hahn-banach extension theorem
in this paper, a fuzzy version of the analytic form of hahn-banachextension theorem is given. as application, the hahn-banach theorem for$r$-fuzzy bounded linear functionals on $r$-fuzzy normedlinear spaces is obtained.
متن کاملA Colored Version of Tverberg's Theorem
The main result of this paper is that given r red, r white, and r green points in the plane, it is possible to form r vertex-disjoint triangles Aj,...,Ar in such a way that A, has one red, one white, and one green vertex for every / = l , . . . , r and the intersection of these triangles is non-empty.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2002
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s004930200016